Heuristic genetic algorithms for general capacitated lot-sizing problems
نویسندگان
چکیده
منابع مشابه
Three Meta-heuristic Algorithms for the Single-item Capacitated Lot-sizing Problem (RESEARCH NOTE)
This paper proposes a mixed integer programming model for single-item capacitated lot-sizing problem with setup times, safety stock, demand shortages, outsourcing and inventory capacity. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA), vibration damping optimization (VDO) and harmony search (HS) have been used to solve this model. Additionally, ...
متن کاملApproximation Algorithms for Capacitated Stochastic Lot-sizing Inventory Control Models
Introduction. We study a class of capacitated stochastic lot-sizing inventory control problems with stochastic, non-stationary and correlated demands that evolve over time. Economies of scale and capacity constraints exist in many practical scenarios. However, models with fixed ordering costs and capacity constraints are typically computationally intractable, and even the structure of the optim...
متن کاملProgressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
We consider a family of N items that are produced in, or obtained from, the same production facility. Demands are deterministic for each item and each period within a given horizon of T periods. If in a given period an order is placed, setup costs are incurred. The aggregate order size is constrained by a capacity limit. The objective is to find a lot-sizing strategy that satisfies the demands ...
متن کاملModels and methods for capacitated lot-sizing problems
This is a summary of the author’s PhD thesis supervised by Philippe Chrétienne and Safia Kedad-Sidhoum and defended in December 2005 at the Université Pierre et Marie Curie (Paris VI). The thesis is written in French and is available from http://absi.nabil.free.fr/ABSI-Thesis.pdf. This work mainly deals with multi-item capacitated lot-sizing problems with setup times, shortages on demand and sa...
متن کاملParallel Genetic Algorithm for the Capacitated Lot-Sizing Problem
A parallel genetic algorithm is presented to solve the well-known ca-pacitated lot-sizing problem. The approach is implemented on a massively parallel single instruction multiple data architecture with 16384 4-bit processors. Based on a random keys representation a schedule is backward oriented obtained which enables us to apply a very simple capacity check. Genetic algorithms are a general pur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2002
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(02)00146-3